On the reduced signless Laplacian spectrum of a degree maximal graph
نویسندگان
چکیده
منابع مشابه
On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum degree Δ, respectively.
متن کاملOn the sum of signless Laplacian eigenvalues of a graph
For a simple graph G, let e(G) denote the number of edges and Sk(G) denote the sum of the k largest eigenvalues of the signless Laplacian matrix of G. We conjecture that for any graph G with n vertices, Sk(G) ≤ e(G) + k+1 2 for k = 1, . . . , n. We prove the conjecture for k = 2 for any graph, and for all k for regular graphs. The conjecture is an analogous to a conjecture by A.E. Brouwer with ...
متن کاملEla on the Main Signless Laplacian Eigenvalues of a Graph
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
متن کاملON THE MAXIMAL SPECTRUM OF A MODULE
Let $R$ be a commutative ring with identity. The purpose of this paper is to introduce and study two classes of modules over $R$, called $mbox{Max}$-injective and $mbox{Max}$-strongly top modules and explore some of their basic properties. Our concern is to extend some properties of $X$-injective and strongly top modules to these classes of modules and obtain some related results.
متن کاملRemoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let [Formula: see text], [Formula: see text] and [Formula: see text] be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, respectively. In this paper, we give lower bounds on [Formula: see text], [Formula: see text], [For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.11.031